A Probabilistic Model for the Distribution of Ranks of Elliptic Curves over Q
نویسنده
چکیده
In this article, we propose a new probabilistic model for the distribution of ranks of elliptic curves in families of fixed Selmer rank, and compare the predictions with previous results, and with the databases of curves over the rationals that we have at our disposal. In addition, we document a phenomenon we refer to as Selmer bias that seems to play an important role in the data and in our models.
منابع مشابه
On Silverman's conjecture for a family of elliptic curves
Let $E$ be an elliptic curve over $Bbb{Q}$ with the given Weierstrass equation $ y^2=x^3+ax+b$. If $D$ is a squarefree integer, then let $E^{(D)}$ denote the $D$-quadratic twist of $E$ that is given by $E^{(D)}: y^2=x^3+aD^2x+bD^3$. Let $E^{(D)}(Bbb{Q})$ be the group of $Bbb{Q}$-rational points of $E^{(D)}$. It is conjectured by J. Silverman that there are infinitely many primes $p$ for which $...
متن کاملOn the rank of certain parametrized elliptic curves
In this paper the family of elliptic curves over Q given by the equation Ep :Y2 = (X - p)3 + X3 + (X + p)3 where p is a prime number, is studied. Itis shown that the maximal rank of the elliptic curves is at most 3 and someconditions under which we have rank(Ep(Q)) = 0 or rank(Ep(Q)) = 1 orrank(Ep(Q))≥2 are given.
متن کاملEfficient elliptic curve cryptosystems
Elliptic curve cryptosystems (ECC) are new generations of public key cryptosystems that have a smaller key size for the same level of security. The exponentiation on elliptic curve is the most important operation in ECC, so when the ECC is put into practice, the major problem is how to enhance the speed of the exponentiation. It is thus of great interest to develop algorithms for exponentiation...
متن کاملGeneralized Jacobian and Discrete Logarithm Problem on Elliptic Curves
Let E be an elliptic curve over the finite field F_{q}, P a point in E(F_{q}) of order n, and Q a point in the group generated by P. The discrete logarithm problem on E is to find the number k such that Q = kP. In this paper we reduce the discrete logarithm problem on E[n] to the discrete logarithm on the group F*_{q} , the multiplicative group of nonzero elements of Fq, in the case where n | q...
متن کاملOn the Elliptic Curves of the Form $y^2 = x^3 − pqx$
By the Mordell- Weil theorem, the group of rational points on an elliptic curve over a number field is a finitely generated abelian group. This paper studies the rank of the family Epq:y2=x3-pqx of elliptic curves, where p and q are distinct primes. We give infinite families of elliptic curves of the form y2=x3-pqx with rank two, three and four, assuming a conjecture of Schinzel ...
متن کامل